◀ Prev · Parts · Full · Next ▶

Algorithm selection is not limited to single domains but can be applied to any kind of algorithm if the above requirements are satisfied. Application domains include:

• hard combinatorial problems:cite-ref-10[10] SAT, Mixed Integer Programming, CSP, AI Planning, TSP, MAXSAT, QBF and Answer Set Programming

• combinatorial auctions

• in machine learning, the problem is known as meta-learning

• software design

• black-box optimization

• multi-agent systems

• numerical optimization

• linear algebra, differential equations

• evolutionary algorithms

• vehicle routing problem

• power systems

◀ Prev · Parts · Full · Next ▶